Exact formulae for the perfect power counting function and the n-th perfect power
نویسندگان
چکیده
منابع مشابه
The perfect power problem for elliptic curves over function fields
We generalise the Siegel–Voloch theorem about S-integral points on elliptic curves as follows: let K/F denote a global function field over a finite field F of characteristic p ≥ 5, let S denote a finite set of places of K and let E/K denote an elliptic curve over K with jinvariant jE / ∈ K. Fix a function f ∈ K(E) with a pole of order N > 0 at the zero of E. We prove that there are only finitel...
متن کاملanalysis of power in the network society
اندیشمندان و صاحب نظران علوم اجتماعی بر این باورند که مرحله تازه ای در تاریخ جوامع بشری اغاز شده است. ویژگیهای این جامعه نو را می توان پدیده هایی از جمله اقتصاد اطلاعاتی جهانی ، هندسه متغیر شبکه ای، فرهنگ مجاز واقعی ، توسعه حیرت انگیز فناوری های دیجیتال، خدمات پیوسته و نیز فشردگی زمان و مکان برشمرد. از سوی دیگر قدرت به عنوان موضوع اصلی علم سیاست جایگاه مهمی در روابط انسانی دارد، قدرت و بازتولید...
15 صفحه اولCounting perfect matchings in n-extendable graphs
The structural theory of matchings is used to establish lower bounds on the number of perfect matchings in n-extendable graphs. It is shown that any such graph on p vertices and q edges contains at least (n + 1)!/4[q − p − (n − 1)(2 − 3) + 4] different perfect matchings, where is the maximum degree of a vertex in G. © 2007 Elsevier B.V. All rights reserved. MSC: 05C70; 05C40; 05C75
متن کاملSome properties of n-capable and n-perfect groups
In this article we introduce the notion of n-capable groups. It is shown that every group G admits a uniquely determined subgroup (〖Z^n)〗^* (G) which is a characteristic subgroup and lies in the n-centre subgroup of the group G. This is the smallest subgroup of G whose factor group is n-capable. Moreover, some properties of n-central extension will be studied.
متن کاملCounting perfect matchings and the switch chain
We examine the problem of exactly or approximately counting all perfect matchings in hereditary classes of nonbipartite graphs. In particular, we consider the switch Markov chain of Diaconis, Graham and Holmes. We determine the largest hereditary class for which the chain is ergodic, and define a large new hereditary class of graphs for which it is rapidly mixing. We go on to show that the chai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematical Forum
سال: 2013
ISSN: 1314-7536
DOI: 10.12988/imf.2013.13051